(The "empty set infimum is positive infinity" convention is like the nullary intersection is everything convention.)
An approach space is defined to be a pair ( X, d) where d is a distance function on X. Every approach space has a topology, given by treating A → A(0) as a Kuratowski closure operator.
The appropriate maps between approach spaces are the contractions. A map f: ( X, d) → ( Y, e) is a contraction if e( f( x), f 'A) ≤ d '(x , A ) for all x ∈ X and A ⊆ X''.
Given a set X, the discrete distance is given by d( x, A) = 0 if x ∈ A and d( x, A) = ∞ if x ∉ A. The induced topology is the discrete topology.
Given a set X, the indiscrete distance is given by d( x, A) = 0 if A is non-empty, and d( x, A) = ∞ if A is empty. The induced topology is the indiscrete topology.
Given a topological space X, a topological distance is given by d( x, A) = 0 if x ∈ A, and d( x, A) = ∞ otherwise. The induced topology is the original topology. In fact, the only two-valued distances are the topological distances.
Let P = 0, ∞ be the extended non-negative real number. Let d+( x, A) = max( x − supremum A, 0) for x ∈ P and A ⊆ P. Given any approach space ( X, d), the maps (for each A ⊆ X) d(., A) : ( X, d) → ( P, d+) are contractions.
On P, let e( x, A) = inf{| x − a| : a ∈ A} for x < ∞, let e(∞, A) = 0 if A is unbounded, and let e(∞, A) = ∞ if A is bounded. Then ( P, e) is an approach space. Topologically, P is the one-point compactification of [0, ∞). Note that e extends the ordinary Euclidean distance. This cannot be done with the ordinary Euclidean metric.
Let β N be the Stone–Čech compactification of the . A point U ∈ β N is an ultrafilter on N. A subset A ⊆ β N induces a filter F( A) = ∩ { U : U ∈ A}. Let b( U, A) = sup{ inf{ | n − j| : n ∈ X, j ∈ E } : X ∈ U, E ∈ F( A) }. Then (β N, b) is an approach space that extends the ordinary Euclidean distance on N. In contrast, β N is not metrizable.
Let XPQ( X) denote the set of xpq-metrics on X. A subfamily G of XPQ( X) is called a gauge if
If G is a gauge on X, then d( x, A) = sup { e( x, a) } : e ∈ G} is a distance function on X. Conversely, given a distance function d on X, the set of e ∈ XPQ( X) such that e ≤ d is a gauge on X. The two operations are inverse to each other.
A contraction f: ( X, d) → ( Y, e) is, in terms of associated gauges G and H respectively, a map such that for all d ∈ H, d( f(.), f(.)) ∈ G.
A tower on X is a set of maps A → Aε for A ⊆ X, ε ≥ 0, satisfying for all A, B ⊆ X and δ, ε ≥ 0
Given a distance d, the associated A → A(ε) is a tower. Conversely, given a tower, the map d( x, A) = inf{ε : x ∈ Aε} is a distance, and these two operations are inverses of each other.
A contraction f:( X, d)→( Y, e) is, in terms of associated towers, a map such that for all ε ≥ 0, f A[ε] ⊆ fAε.
Certain hyperspaces, measure space, and probabilistic metric spaces turn out to be naturally endowed with a distance. Applications have also been made to approximation theory.
|
|